On Hallian digraphs and their binding number
نویسندگان
چکیده
منابع مشابه
On Panchromatic Digraphs and the Panchromatic Number
Let D = (V,A) be a simple digraph, and let π(D), the panchromatic number of D, be the maximum number of colours k such that for each colouring of its arcs ς : A → [k] a kernel by monochromatic paths N ⊂ V , as introduced in [6], exists. It is not hard to see that D has a kernel —in the sense of Von Neumann [11]— if and only if π(D) = |A|. In this note this invariant is introduced and some of it...
متن کاملturkish-israeli relations and their implication on iranian national security
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
15 صفحه اولin translation: translators on their work and what it means
کتاب در باب ترجمه، اثر استر آلن و سوزان برنوفسکی منتشر شده در ماه می 2013 توسط نشریه کلمبیا است. نویسندگان در این کتاب به بررسی 18 مترجم با در نظر گرفتن نقش آثاری که این مترجمان ترجمه کرده اند میپردازند. کتاب به دو بخش تقسیم میشود: " مترجم در جهان" و " کار مترجم" این دو بخش مقالات همیشگی ترجمه و موقعیت خاص ادبیات بیگانه در جهان وسیع امروزی را مورد خطاب قرار میدهد. در این کتاب مقالات متعددی از ن...
On the heterochromatic number of circulant digraphs
The heterochromatic number hc(D) of a digraph D, is the minimum integer k such that for every partition of V (D) into k classes, there is a cyclic triangle whose three vertices belong to different classes. For any two integers s and n with 1 ≤ s ≤ n, let Dn,s be the oriented graph such that V (Dn,s) is the set of integers mod 2n+1 and A(Dn,s) = {(i, j) : j − i ∈ {1, 2, . . . , n} \ {s}}. In thi...
متن کاملPaths and Stability Number in Digraphs
The Gallai-Milgram theorem says that the vertex set of any digraph with stability number k can be partitioned into k directed paths. In 1990, Hahn and Jackson conjectured that this theorem is best possible in the following strong sense. For each positive integer k, there is a digraph D with stability number k such that deleting the vertices of any k− 1 directed paths in D leaves a digraph with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1989
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-25-1-33-37